Fast, Flexible, and Declarative Construction of Abstract Syntax Trees with PEGs
نویسندگان
چکیده
منابع مشابه
Fast, Flexible, and Declarative Construction of Abstract Syntax Trees with PEGs
We address a declarative construction of abstract syntax trees with Parsing Expression Grammars. AST operators (constructor, connector, and tagging) are newly defined to specify flexible AST constructions. A new challenge coming with PEGs is the consistency management of ASTs in backtracking and packrat parsing. We make the transaction AST machine in order to perform AST operations in the conte...
متن کاملMerkelized Abstract Syntax Trees
In the context of modern cryptosystems, a common theme is the creation of distributed trust networks. In most of these designs, permanent storage of a contract is required. However, permanent storage can become a major performance and cost bottleneck. As a result, good code compression schemes are a key factor in scaling these contract based cryptosystems. For this project, we formalize and imp...
متن کاملCanonical Abstract Syntax Trees
This paper presents GOM, a language for describing abstract syntax trees and generating a Java implementation for those trees. GOM includes features allowing to specify and modify the interface of the data structure. These features provide in particular the capability to maintain the internal representation of data in canonical form with respect to a rewrite system. This explicitly guarantees t...
متن کاملSyntax and Semantics of Abstract Binding Trees
binding trees (abts) are a generalization of abstract syntax trees where operators may express variable binding structure as part of their arities. Originally formulated by Peter Aczel [1], unisorted abts have been deployed successfully as the uniform syntactic framework for several implementations of Constructive Type Theory, including Nuprl [3], MetaPRL [13] and JonPRL [21]. In Practical Foun...
متن کاملCompressed Abstract Syntax Trees for Mobile Code
Abstract syntax trees (ASTs) have numerous advantages as a mobile code format over the more commonly used bytecode-based formats. Not only are ASTs portable, inherently safer, and more suitable for optimization, but we show that they also compress more densely. We have developed a prototype framework for AST compression, which we have used to compress Java programs. Our generic implementation r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2016
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.24.123